The Rank Facets of the Stable Set Polytope for Claw-Free Graphs

نویسندگان

  • Anna Galluccio
  • Antonio Sassano
چکیده

This paper provides a complete characterization of all the rank facets of the stable set polytope STAB(G) associated with a claw-free graph G. In particular, it is shown that a claw-free graph G produces a rank facet of STAB(G) if and only if it can be obtained by means of two simple lifting procedures from three basic classes of graphs: (i) cliques, (ii) line graphs of minimal 2-connected hypomatchable graphs and (iii) circulant graphs C αω+1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Stable Set Polytope of Claw-Free Graphs

In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been made and we hope to the contrary that this thesis contains some important advances and that the reader will share this point of view. Unders...

متن کامل

On facets of stable set polytopes of claw-free graphs with stability number three

Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a breakthrough for the subclass of quasi-line graphs. As a consequence, every non-trivial facet of their stable set polytope is of the form k ∑ v∈V1 xv+(k+1) ∑ v∈V2 xv ≤ b for some positive integers k and b, and non-empty...

متن کامل

Almost all webs are not rank-perfect

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [9]. Ben Rebea conjectured a description for quasi-line graphs, see [12]; Chudnovsky and Seymour [2] v...

متن کامل

On the facets of the stable set polytope of quasi-line graphs

It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even no conjecture at hand today. Such a conjecture exists for the class of quasi-line graphs. This class of graphs is a proper superclass of line g...

متن کامل

Webs and line graphs belong to the classes of quasi-line graphs and claw-free graphs

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [9]. Ben Rebea conjectured a description for quasi-line graphs, see [12]; Chudnovsky and Seymour [2] v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 69  شماره 

صفحات  -

تاریخ انتشار 1997